Correction to: Guess Free Maximization of Submodular and Linear Sums
نویسندگان
چکیده
A Correction to this paper has been published: 10.1007/s00453-020-00757-9
منابع مشابه
Submodular and Linear Maximization with Knapsack Constraints
1 Abbreviations and Notations 3
متن کاملProbabilistic Submodular Maximization in Sub-Linear Time
In this paper, we consider optimizing submodular functions that are drawn from some unknown distribution. This setting arises, e.g., in recommender systems, where the utility of a subset of items may depend on a user-specific submodular utility function. In modern applications, the ground set of items is often so large that even the widely used (lazy) greedy algorithm is not efficient enough. A...
متن کاملOnline Submodular Maximization with Free Disposal: Randomization
We study the online submodular maximization problem with free disposal under a matroid constraint. Elements from some ground set arrive one by one in rounds, and the algorithm maintains a feasible set that is independent in the underlying matroid. In each round when a new element arrives, the algorithm may accept the new element into its feasible set and possibly remove elements from it, provid...
متن کاملSubmodular Maximization through the Lens of Linear Programming
The simplex algorithm for linear programming is based on the fact that any local optimum with respect to the polyhedral neighborhood is also a global optimum. We show that a similar result carries over to submodular maximization. In particular, every local optimum of a constrained monotone submodular maximization problem yields a 1/2-approximation, and we also present an appropriate extension t...
متن کاملSubmodular Welfare Maximization
We study different variants of the welfare maximization problem in combinatorial auctions. Assume there are n buyers interested in m items. Indeed they have different valuations on each item, i.e. buyer i has a valuation of wi(j) on item j. In the simplest model, a collection of items S worths ∑ j∈S wi(j) for buyer i; However, in practice, collection of items might have different values than th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2022
ISSN: ['1432-0541', '0178-4617']
DOI: https://doi.org/10.1007/s00453-022-01028-5